Moving Least Squares Approximation
ثبت نشده
چکیده
An alternative to radial basis function interpolation and approximation is the so-called moving least squares method. As we will see below, in this method the approximation Pf to f is obtained by solving many (small) linear systems, instead of via solution of a single – but large – linear system as we did in the previous chapters. To make a connection with the previous chapters we start with the Backus-Gilbert formulation of the moving least squares method since this corresponds to a linearly constrained quadratic minimization problem.
منابع مشابه
A meshless discrete Galerkin method for solving the universe evolution differential equations based on the moving least squares approximation
In terms of observational data, there are some problems in the standard Big Bang cosmological model. Inflation era, early accelerated phase of the evolution of the universe, can successfully solve these problems. The inflation epoch can be explained by scalar inflaton field. The evolution of this field is presented by a non-linear differential equation. This equation is considered in FLRW model...
متن کاملA New Technique for Image Zooming Based on the Moving Least Squares
In this paper, a new method for gray-scale image and color zooming algorithm based on their local information is offered. In the proposed method, the unknown values of the new pixels on the image are computed by Moving Least Square (MLS) approximation based on both the quadratic spline and Gaussian-type weight functions. The numerical results showed that this method is more preferable to biline...
متن کاملOptimal Pareto Parametric Analysis of Two Dimensional Steady-State Heat Conduction Problems by MLPG Method
Numerical solutions obtained by the Meshless Local Petrov-Galerkin (MLPG) method are presented for two dimensional steady-state heat conduction problems. The MLPG method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. The penalty method is adopted to efficiently enforce the essential boundary co...
متن کاملToward Approximate Moving Least Squares Approximation with Irregularly Spaced Centers
By combining the well known moving least squares approximation method and the theory of approximate approximations due to Maz’ya and Schmidt we are able to present an approximate moving least squares method which inherits the simplicity of Shepard’s method along with the accuracy of higher-order moving least squares approximations. In this paper we focus our interest on practical implementation...
متن کاملIterated Approximate Moving Least Squares Approximation
The radial basis function interpolant is known to be the best approximation to a set of scattered data when the error is measured in the native space norm. The approximate moving least squares method, on the other hand, was recently proposed as an efficient approximation method that avoids the solution of the system of linear equations associated with the radial basis function interpolant. In t...
متن کاملDigital Image Correlation Analyses Using Moving Least Squares Approximation
Introduction Moving least squares approximation is one kind of meshless methods in which the approximation is built from nodes only. Comparing to mesh-based methods, meshless methods have advantages on (1) refining is simpler to incorporate, (2) moving discontinuities can be treated easily, (3) large deformation can be handled robustly, (4) higher-order continuous shape functions, (5) non-local...
متن کامل